Tight Bounds for Depth-two Superconcentrators

We show that the minimum size of a depth-two N-superconcentrator is (N log 2 N= loglog N). Before this work, optimal bounds were known for all depths except two. For the upper bound, we build superconcentrators by putting together a small number of disperser graphs; these disperser graphs are obtained using a probabilistic argument. We present two diierent methods for showing lower bounds. First, we show that superconcentrators contain several disjoint disperser graphs. When combined with the lower bound for disperser graphs due to K} ovari, SS os and Turr an, this gives an almost optimal lower bound of (N(log N= loglog N) 2) on the size of N-superconcentrators. The second method, based on the work of Hansel, gives the optimal lower bound. The method of the K} ovari, SS os and Turr an can be extended to give tight lower bounds for extractors, both in terms of the number of truly random bits needed to extract one additional bit and in terms of the unavoidable entropy loss in the system. If the input is an n-bit source with min-entropy k and the output is required to be within a distance of from uniform distribution, then to extract even a constant number of additional bits, one must invest at least log(n ? k) + 2 log(1==) ? O(1) truly random bits; to obtain m output bits one must invest at least m ? k + 2 log(1==) ? O(1). Thus, there is a loss of 2 log(1==) bits during the extraction. Interestingly, in the case of dispersers this loss in entropy is only about log log(1==).